Optimal Prescriptive Trees

Optimal Trees

Optimal 2, 3-Trees

The 2,3-trees that are optimal in the sense of having minimal expected number of nodes visited per access are characterized in terms of their "profiles". The characterization leads directly to a linear-time algorithm for constructing a K-key optimal 2,3-tree for a sorted list of K keys. A number of results are derived that demonstrate how different in structure these optimal 2,3-trees are from ...

Optimal Alphabetic Ternary Trees

We give a new algorithm to construct optimal alphabetic ternary trees, where every internal node has at most three children. This algorithm generalizes the classic Hu-Tucker algorithm, though the overall computational complexity has yet to be determined.

Optimal junction Trees

Finn V. Jensen Frank Jensen Department of Mathematics and Computer Science Aalborg University Fredrik Bajers Vej 7E, DK-9220 Aalborg st, Denmark E-mail: [email protected], [email protected] Abstract The paper deals with optimality issues in connection with updating beliefs in networks. We address two processes: triangulation and construction of junction trees. In the rst part, we give a simple algor...

Optimal Binary Search Trees

An optimal binary search tree is a binary search tree for which the nodes are arranged on levels such that the tree cost is minimum. For the purpose of a better presentation of optimal binary search trees, we will consider “extended binary search trees”, which have the keys stored at their internal nodes. Suppose “n” keys k1, k2, ... , k n are stored at the internal nodes of a binary search tre...